A distributed algorithm to find k-dominating sets
نویسندگان
چکیده
منابع مشابه
A distributed algorithm to find k-dominating sets
We consider a connected undirected graph G(n,m) with n nodes and m edges. A k-dominating set D in G is a set of nodes having the property that every node in G is at most k edges away from at least one node in D. Finding a k-dominating set of minimum size is NP-hard. We give a new synchronous distributed algorithm to find a k-dominating set in G of size no greater than ⌊n/(k + 1)⌋. Our algorithm...
متن کاملOn non-z(mod k) dominating sets
For a graph G, a positive integer k, k ≥ 2, and a non-negative integer with z < k and z 6= 1, a subset D of the vertex set V (G) is said to be a non-z (mod k) dominating set if D is a dominating set and for all x ∈ V (G), |N [x] ∩ D| 6≡ z (mod k). For the case k = 2 and z = 0, it has been shown that these sets exist for all graphs. The problem for k ≥ 3 is unknown (the existence for even values...
متن کاملDominating sets in k-majority tournaments
A k-majority tournament T on a finite vertex set V is defined by a set of 2k − 1 linear orderings of V , with u→ v if and only if u lies above v in at least k of the orders. Motivated in part by the phenomenon of “non-transitive dice”, we let F (k) be the maximum over all k-majority tournaments T of the size of a minimum dominating set of T . We show that F (k) exists for all k > 0, that F (2) ...
متن کاملA Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks
A Connected Dominating Set (CDS) of the graph representing a Wireless Sensor Network can be used as a virtual backbone for routing in the network. Since sensor nodes are constrained by limited on-board batteries, it is desirable to have a small CDS for the network. However, constructing a minimum size CDS has been shown to be a NP-hard problem. In this paper we present a distributed greedy algo...
متن کاملTree-based Algorithm to Find the k-th Value in Distributed Systems
In this paper, we study distributed algorithms for nding the k-th value in the decentralized systems. First we consider the case of circular con guration of processors where no processor knows the total number of participants. Later a network of arbitrary conguration is examined and a tree-based algorithm is proposed. The proposed algorithm requires O(N ) messages and O(logN ) rounds of message...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00368-8